time hierarchy theoremの例文
もっと例文: 1 2
- In fact, by the time hierarchy theorem, they cannot be solved in significantly less than exponential time.
- For instance, the time hierarchy theorem tells us that P is strictly contained in EXPTIME, and the space hierarchy theorem tells us that L is strictly contained in PSPACE.
- Because of the time hierarchy theorem, these classes form a strict hierarchy; we know that \ mathrm { P } \ subsetneq \ mathrm { EXPTIME }, and on up.
- He is best known for his Turing-award winning paper with Richard Stearns, in which he introduced time complexity classes " TIME ( f ( n ) ) " and proved the time hierarchy theorem.
- proves that ACC 0 does not contain NEXPTIME . The proof uses many results in complexity theory, including the time hierarchy theorem, IP = PSPACE, derandomization, and the representation of ACC 0 via SYM + circuits.